Triangular Lattice Foldings - a Transfer Matrix Study

نویسندگان

  • Y. KANT
  • M. V. JARIC
چکیده

Connection between discrete and continuum models of polymerized (tethered) surfaces has been investigated by applying a transfer matrix method to a discrete rigid-bond triangular lattice, which is allowed to fold on itself along its bonds in a two-dimensional embedding space. As its continuum counterpart, the model has an extensive entropy and the mean squared distance between two sites of a folded lattice increases logarithmically with the linear distance between the sites in the unfolded state. The model lattice with bending rigidity remains unfolded at any finite temperature, unlike real polymerized surfaces. Properties of polymerized or tethered membranes (surfaces) have been an object of numerous recent studies [l-61. We can view the polymerized surfaces as a generalization [l] of linear polymers [7]. This analogy has been used [3] to investigate the properties of self-avoiding tethered surfaces. However, unlike in the linear polymers, the long length-scale behavior of tethered surfaces strongly depends on the details of the Hamiltonian. In particular, very rigid surfaces exhibit a nontrivial [6] flat one. As the rigidity of a surface changes it undergoes a second-order phase transition [l, 4,5] from a crumpled (linear-polymerlike) phase to a flat phase. Neither the flat phase nor the crumpling transition has an analogy in linear polymers. The theoretical treatment of long length-scale properties of linear polymers rests on a fkm foundation, since in the absence of self-avoiding (excluded volume, steric) interactions their properties can be calculated exactly. In particular, it can be shown that the end-to-end distance (both in continuum and on a discrete lattice) of a long polymer described by any local Hamiltonian obeys the Gaussian probability distribution. Thus on sufficiently long length-scales the polymer can be described by an effective Hamiltonian H I = = KkB T$dx(dr/dx)2, where r is the position of a monomer in the d-dimensional embedding space, while x is the i n t e m l coordinate (label) of a monomer. A straightforward generalization of H I assumes that at long length-scale two-dimensional (2d) polymerized membranes without self-avoiding interactions will be described by H2 = KkB T$d2x(Vr)2, where x is the internal coordinate of a monomer, i.e. its position in the 2d network, while (Vr)2 (W&1)2 + (W ~ X ~) ~ .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Few Optimal Foldings of HP Protein Chains on Various Lattices ∗

We consider whether or not protein chains in the HP model have unique or few optimal foldings. We solve the conjecture proposed by Aichholzer et al. that the open chain L2k−1 = (HP )(PH) for k ≥ 3 has exactly two optimal foldings on the square lattice. We show that some closed and open chains have unique optimal foldings on the hexagonal and triangular lattices, respectively.

متن کامل

X iv : h ep - t h / 95 07 16 1 v 1 2 8 Ju l 1 99 5 Folding transitions of the triangular lattice with defects

A recently introduced model describing the folding of the triangular lattice is generalized allowing for defects in the lattice and written as an Ising model with nearest– neighbor and plaquette interactions on the honeycomb lattice. Its phase diagram is determined in the hexagon approximation of the cluster variation method and the crossover from the pure Ising to the pure folding model is inv...

متن کامل

Geometrical Folding Transitions of the Triangular Lattice in the Face - Centred Cubic Lattice

We study the folding of the regular two-dimensional triangular lattice embedded in the regular three-dimensional Face-Centred Cubic lattice, a discrete model for the crumpling of membranes. Possible folds are complete planar folds, folds with the angle of a regular tetrahedron (71 •) or with that of a regular octahedron (109 •). We study this model in the presence of a negative bending rigidity...

متن کامل

Studies of protein designability using reduced models

One the most important problems in computational structural biology is protein designability, that is, why protein sequences are not random strings of amino acids but instead show regular patterns that encode protein structures. Many previous studies that have attempted to solve the problem have relied upon reduced models of proteins. In particular, the 2D square and the 3D cubic lattices toget...

متن کامل

Folding transitions of the triangular lattice with defects.

A recently introduced model describing the folding of the triangular lattice is generalized allowing for defects in the lattice and written as an Ising model with nearest– neighbor and plaquette interactions on the honeycomb lattice. Its phase diagram is determined in the hexagon approximation of the cluster variation method and the crossover from the pure Ising to the pure folding model is inv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1990